Faster and Faster Convergent Series for $\zeta(3)$

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Faster Convergent Infinite Series

Recommended by Laszlo Toth Suffcient conditions, necessary conditions for faster convergent infinite series, faster τ-convergent infinite series are studied. The faster convergence of infinite series of Kummer's type is proved. Copyright q 2008 Dušan Hoí y et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distributi...

متن کامل

Improved Skips for Faster Postings List Intersection

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

متن کامل

Improved Skips for Faster Postings List Intersection

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

متن کامل

Better and Faster Patient Training

اقامت هرچه کوتاهتر بیمار در بیمارستان، مستلزم آموزش مؤثر او و خانواده وی است

متن کامل

Faster exponentials of power series

We describe a new algorithm for computing exp f where f is a power series in CJxK. If M(n) denotes the cost of multiplying polynomials of degree n, the new algorithm costs (2.1666 . . . + o(1))M(n) to compute exp f to order n. This improves on the previous best result, namely (2.333 . . . + o(1))M(n). The author recently gave new algorithms for computing the square root and reciprocal of power ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 1996

ISSN: 1077-8926

DOI: 10.37236/1237